ALGORITHM & DOCUMENTATION: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems pdfsubject=MINRES-QLP for indefinite or singular symmetric systems
نویسندگان
چکیده
We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-definite preconditioner may be supplied. Our FORTRAN 90 implementation illustrates a design pattern that allows users to make problem data known to the solver but hidden and secure from other program units. In particular, we circumvent the need for reverse communication. While we focus here on a FORTRAN 90 implementation, we also provide and maintain MATLAB versions of MINRES and MINRES-QLP.
منابع مشابه
ALGORITHM & DOCUMENTATION: MINRES-QLP for Symmetric and Hermitian Linear Equations and Least-Squares Problems pdfsubject=MINRES-QLP for indefinite or singular symmetric systems
We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-...
متن کاملMINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
CG, SYMMLQ, and MINRES are Krylóv subspace methods for solving symmetric systems of linear equations. When these methods are applied to an incompatible system (that is, a singular symmetric least-squares problem), CG could break down and SYMMLQ’s solution could explode, while MINRES would give a least-squares solution but not necessarily the minimum-length (pseudoinverse) solution. This underst...
متن کاملALGORITHM xxx: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems
We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the minimum-length solution. In all cases, it circumvents a potential instability in the original MINRES algorithm. A positive-definite preconditioner may be supplied. Our FORTRAN 90 implementation illustra...
متن کاملMinimal Residual Methods for Complex Symmetric, Skew Symmetric, and Skew Hermitian Systems
While there is no lack of efficient Krylov subspace solvers for Hermitian systems, few exist for complex symmetric, skew symmetric, or skew Hermitian systems, which are increasingly important in modern applications including quantum dynamics, electromagnetics, and power systems. For a large, consistent, complex symmetric system, one may apply a non-Hermitian Krylov subspace method disregarding ...
متن کاملNew Krylov-subspace Solvers for Hermitian Positive Definite Matrices with Indefinite Preconditioners
Incomplete LDL∗ factorizations sometimes produce an inde nite preconditioner even when the input matrix is Hermitian positive de nite. The two most popular iterative solvers for Hermitian systems, MINRES and CG, cannot use such preconditioners; they require a positive de nite preconditioner. We present two new Krylov-subspace solvers, a variant of MINRES and a variant of CG, both of which can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013